Automatic Generation of Programs with Grammatical Evolution
نویسنده
چکیده
Grammatical Evolution (GE) is a grammar based Evolutionary Algorithm to generate computer programs which has been shown to be competitive with Genetic Programming when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate arbitrarily complex programs in any language, including loops, multiple line functions etc. Part of the power of GE is that it is closer to natural DNA than GP, and thus can beneet from natural phenomena such as a separation of search and solution spaces through a genotype to phenotype mapping and a genetic code degeneracy which can give rise to neutral mutations (Mutations that have no eeect on the phenotype). In this paper we describe how GE was applied to the real world problem of evolving a Caching Algorithm, at which GP has been found to generate algorithms that did not perform as well as those designed by humans. GE was found to generate caching algorithms which clearly outperform those generated by GP.
منابع مشابه
gramEvol: Grammatical Evolution in R
We describe an R package which implements grammatical evolution (GE) for automatic program generation. By performing an unconstrained optimisation over a population of R expressions generated via a user-defined grammar, programs which achieve a desired goal can be discovered. The package facilitates the coding and execution of GE programs, and supports parallel execution. In addition, three app...
متن کاملGrammatical Evolution: Evolving Programs for an Arbitrary Language
We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar deenition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.
متن کاملAutomatic Generation of High Level Functions using Evolutionary Algorithms
Evolutionary Algorithms, based upon the Darwinian principle of Natural Selection, have been applied with varying degrees of success to a broad range of problem domains, including the automatic induction of computer programs. This paper describes Grammatical Evolution (GE), an evolutionary algorithm approach to automatic programming, which employs variable length, binary chromosomes. The binary ...
متن کاملGrammatical Swarm: A Variable-Length Particle Swarm Algorithm
This study examines a variable-length Particle Swarm Algorithm for Social Programming. The Grammatical Swarm algorithm is a form of Social Programming as it uses Particle Swarm Optimisation, a social swarm algorithm, for the automatic generation of programs. This study extends earlier work on a fixed-length incarnation of Grammatical Swarm, where each individual particle represents choices of p...
متن کاملGrammar based function definition in Grammatical Evolution
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the function and the code belonging to the main body of the program which has the ability to call upon the evolving function. As proof of concept we apply a grammar using automatic function definition to the Santa Fe ant tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007